Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review

For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation previous review and seeks to draw comprehensive picture various ways binarize this type metaheuristics; study uses standard systematic consisting analysis 512 publications from 2017 January 2022 (5 years). The work will provide theoretical foundation novice researchers tackling optimization using metaheuristic algorithms expert analyzing mechanism’s impact on algorithms’ performance. Structuring information allows improving results broadening spectrum binary problems be solved. We can conclude that there no single general technique capable efficient binarization; instead, are multiple forms with different performances.